Empirically Guided Software Guesstimation

نویسندگان

  • Philip M. Johnson
  • Carleton A. Moore
  • Joseph A. Dane
  • Robert S. Brewer
چکیده

The state of the art in software project estimation does not deserve this reputation, but the fact remains that modern methods are time-consuming and complex. Estimation methods such as COCOMO II [3] are oriented toward the needs of large and very large software engineering projects, and may require time-consuming calibration to fit the peculiarities of an organization, development team, and application domain. On the other hand, methods such as the Personal Software Process [8] have demonstrated good results in improving small/individual project estimation accuracy, but advocates promote the need for specialized training and adherence to a highly constrained approach to development. Although these approaches have demonstrated success in organizations with the resources necessary to adopt them, the process overhead involved in

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Empirically Guided Software Effort Guesstimation

Software project effort estimation is frequently seen as complex and expensive for individual software engineers. In Project LEAP, we are investigating tools and methods to support low-cost, empirically-based software developer improvement. In a recent case study, we investigated effort estimation and the relative accuracy of a dozen different analytic estimation procedures. Student programmers...

متن کامل

Using Linked Data for Semi-Automatic Guesstimation

GORT is a system that combines Linked Data from across several Semantic Web data sources to solve guesstimation problems, with user assistance. The system uses customised inference rules over the relationships in the OpenCyc ontology, combined with data from DBPedia, to reason and perform its calculations. The system is extensible with new Linked Data, as it becomes available, and is capable of...

متن کامل

Semi-Automatic Guesstimation

Guesstimation is a widely-used technique for finding answers to numeric questions that require combining knowledge of potentially unrelated facts with proof plans. Solutions to guesstimation questions require the application of a small set of general or domainspecific plans, supported by numeric facts and ontological knowledge. Guesstimation, therefore, is an ideal topic under which to explore ...

متن کامل

Solving guesstimation problems using the Semantic Web: Four lessons from an application

We draw on our experience of implementing a semi-automated guesstimation application of the Semantic Web, GORT, to draw four lessons, which we claim are of general applicability. These are: 1. Inference can unleash the Semantic Web; 2. The Semantic Web does not constrain the inference mechanisms; 3. Curation must be dynamic; and 4. Own up to uncertainty.

متن کامل

A Single-Significant-Digit Calculus for Semi-Automated Guesstimation

We describe a single-significant-digit calculus for estimating approximate solutions to guesstimation problems. The calculus is formalised as a collection of proof methods, which are combined into proof plans. These proof methods have been implemented as rewrite rules and successfully evaluated in an interactive system, gort, which forms a customised proof plan for each problem and then execute...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000